Explicit Formulas for the Moments of the Sojourn Time in the M/g/1 Processor Sharing Queue with Permanent Jobs
نویسنده
چکیده
We give some representation about recent achievements in analysis of the M/G/1 queue with egalitarian processor sharing discipline (EPS). The new formulas are derived for the j-th moments (j ∈ N) of the (conditional) stationary sojourn time in the M/G/1—EPS queue with K (K ∈ 0 ∪ N) permanent jobs of infinite size. We discuss also how to simplify the computations of the moments.
منابع مشابه
Explicit formulas for the variance of conditioned sojourn times in M/D/1-PS
For the M/D/1 processor sharing queue, explicit formulas for the coefficient of variation of the sojourn time conditioned on the service time and on the residual service times of the tasks found on arrival are derived via branching representations. keywords: processor sharing, sojourn times, variance, branching
متن کاملSojourn time asymptotics in the MG1 processor sharing queue
We show for the M/G/1 processor sharing queue that the service time distribution is regularly varying of index −ν, ν non-integer, iff the sojourn time distribution is regularly varying of index −ν. This result is derived from a new expression for the Laplace–Stieltjes transform of the sojourn time distribution. That expression also leads to other new properties for the sojourn time distribution...
متن کاملSojourn Time Asymptotics in the M / G / 1 Processor Sharing
We show for the M/G/1 processor sharing queue that the service time distribution is regularly varying of index ?, non-integer, ii the sojourn time distribution is regularly varying of index ?. This result is derived from a new expression for the Laplace-Stieltjes transform of the sojourn time distribution. That expression also leads to other new properties for the sojourn time distribution. We ...
متن کاملDiffusion Process for GGR Machining System with Spares, Balking and Reneging (RESEARCH NOTE)
This paper deals with the G/G/R machining system consisting of M operating machines as well as S cold standbys. The concepts of balking and reneging are incorporated which make our model more versatile to deal with real time systems. The broken-down machines are sent to repair facilities consisting of R permanent repairmen. The failure times and repair times are generally identical and independ...
متن کاملEstimating mean sojourn time in the processor sharing M/G/1 queue with inaccurate job size information
We seek to approximate the mean sojourn time in the processor sharing M/G/1 queue with inaccurate job size information. Suppose we are given the arrival rate λ and random service time Ŝ = SX where X ∼ LN(0, σ) represents the inaccuracy. Denote the mean sojourn time in an M/G/1 queue with processor sharing with service time Ŝ by E(T̂) and with service time S by E(T). Finally, E(T̂) denotes the mea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005